<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tag/html/model checking/?t=model+checking">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tag/html/model checking/?t=model+checking]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for model checking]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/906/Solving-Hard-SAT-Instances-with-Adiabatic-Quantum-Computers"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/384/Using-OWL-to-Model-Role-Based-Access-Control"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/906/Solving-Hard-SAT-Instances-with-Adiabatic-Quantum-Computers">
  <title><![CDATA[Solving Hard SAT Instances with Adiabatic Quantum Computers]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/906/Solving-Hard-SAT-Instances-with-Adiabatic-Quantum-Computers</link>
  <description><![CDATA[Regardless of debates between "P" and "NP", current classical computers can only approximate global optimum solutions through applying heuristics and meta-heuristics. Despite remarkable advancements that have been provided through distributing the computations over many processing units, exploring exponentially large spaces is still out of reach for indecomposable problems. Boolean satisfiability problem (SAT) plays a cornerstone role for countless complex real-world problems -ranging from mo...]]></description>
  <dc:date>2018-12-10</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/384/Using-OWL-to-Model-Role-Based-Access-Control">
  <title><![CDATA[Using OWL to Model Role Based Access Control]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/384/Using-OWL-to-Model-Role-Based-Access-Control</link>
  <description><![CDATA[Current access control research follows two parallel themes: many efforts focus on developing novel access control models that meet the policy needs of real-world application domains, while others explore new policy languages. This paper is motivated by the desire to develop a synergy between these themes facilitated by OWL. Our vision for the future is a world where advanced access control concepts are embodied in models supported by policy languages in a natural, intuitive manner, while all...]]></description>
  <dc:date>2008-02-01</dc:date>
 </item>
</rdf:RDF>
